An Efficient Algorithm for Tree Mapping in XML Databases
نویسنده
چکیده
In this article, we discuss an efficient algorithm for tree mapping problem in XML databases. Given a target tree T and a pattern tree Q, the algorithm can find all the embeddings of Q in T in O(|T||Q|) time while the existing approaches need exponential time in the worst case.
منابع مشابه
Mapping XML to inverted indexed circular linked lists
Extensible Markup Language (XML) has become the de facto standard for data exchange on the World Wide Web and is widely used in many fields, so it is urgent to develop some efficient methods to manage, store, and query XML data. Traditional methods use relational databases to store XML data which take advantage of mature technologies of relational databases. But it needs to map XML schemas to r...
متن کاملAn Efficient Xml Database Mining without Candidate Generation: an Frequent Pattern Split Approach
The popularity of XML results in producing large numbers of XML documents. Therefore, to develop an approach of association rule mining on native XML databases is an important research. The FP-growth based on an FP-tree algorithm performs more efficiently than other methods of association rules mining, but it cannot be applied to native XML databases. Hence, we adaptive an improving FPtree algo...
متن کاملXMap: A Novel Approach to Store and Retrieve XML Document in Relational Databases
Due to Its simplicity, its flexibility and its expansion possibilities, XML can be adapted to multiple domains. Its self-described structure and nesting, allows XML to become the dominant standard for storing and transferring data through the World Wide Web. In addition the relational database systems are mature and extremely powerful. Therefore, many researches have been done to propose an eff...
متن کاملStoring and Updating XML Data Tree based on Linked Lists
XML has become the de facto standard for data exchange and transformation on the World Wide Web and is widely used in many applications of various fields, so it is urgent to develop some efficient methods to manage, store, query, and update XML data. There are two main methods to do this: the first method is a native approach which uses native XML databases to store XML data, and the second met...
متن کاملEfficient Querying and Updating of XML Data The Rainforest Data Structure
With the advent of the World Wide Web and the increase in information sharing it has brought, information interchange formats based on XML have become more and more important, and the need has arisen to store and process semistructured data. Prior work has mainly focused on developing XML extensions for relational database systems, with a focus on querying. This research takes a different tack,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007